A New Hybrid Meta-Heuristics Approach to Solve the Parallel Machine Scheduling Problem Considering Human Resiliency Engineering

Authors

  • Masoud Rabani School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran
  • Reza Yazdanparast School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran
  • soroush aghamohamadi School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran
Abstract:

This paper proposes a mixed integer programming model to solve a non-identical parallel machine (NIPM) scheduling with sequence-dependent set-up times and human resiliency engineering. The presented mathematical model is formulated to consider human factors including Learning, Teamwork and Awareness. Moreover, processing time of jobs are assumed to be non-deterministic and dependent to their start time which leads to more precision and reality. The applicability of the proposed approach is demonstrated in a real world car accessories industrial unit. A hybrid metaheuristic method based on Genetic algorithm (GA) and simulated annealing (SA) is proposed to solve the problem. Parameter tuning is applied for adjustment of metaheuristic algorithm parameters.The superiority of the proposed hybrid metaheuristic method is evaluated by comparing the obtained results to GAMS, and two other hybrid metaheuristics. Moreover, it is shown that the hybrid approach provides better solutions than other hybrid approaches.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Heuristic approach to solve hybrid flow shop scheduling problem with unrelated parallel machines

In hybrid flow shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs are processed on k machines. A mixed integer linear programming (MILP) model for the HFS scheduling problems with unrelated parallel machines has been proposed to minimize the maximum completion time (makespan). Since the problem is shown to be NP-complete, it is necessary to use heuristic methods to ...

full text

A Hybrid Solution Approach Based on Benders Decomposition and Meta-Heuristics to Solve Supply Chain Network Design Problem

Supply Chain Network Design (SCND) is a strategic supply chain management problem that determines its configuration. This mainly focuses on the facilities location, capacity sizing, technology selection, supplier selection, transportation, allocation of production and distribution facilities to the market, and so on. Although the optimal solution of the SCND problem leads to a significant reduc...

full text

Comparing Three Proposed Meta-heuristics to Solve a New p-hub Location-allocation Problem

This paper presents a new mathematical model, in which the location of hubs is fixed and their capacity is determined based on facilities and factories allocated to it. In order to feed the client's nodes, different types of vehicles of different capacities are considered, in which the clients are allocated to hubs, and types and numbers of vehicles are allocated to the factory's facilities. To...

full text

A Possibility Linear Programming Approach to Solve a Fuzzy Single Machine Scheduling Problem

This paper employs an interactive possibility linear programming approach to solve a single machine scheduling problem with imprecise processing times, due dates, as well as earliness and tardiness penalties of jobs. The proposed approach is based on a strategy of minimizing the most possible value of the imprecise total costs, maximizing the possibility of obtaining a lower total costs, and mi...

full text

A New Approach to Solve N-Queen Problem with Parallel Genetic Algorithm

Over the past few decades great efforts were made to solve uncertain hybrid optimization problems. The n-Queen problem is one of such problems that many solutions have been proposed for. The traditional methods to solve this problem are exponential in terms of runtime and are not acceptable in terms of space and memory complexity. In this study, parallel genetic algorithms are proposed to solve...

full text

A Hybrid Genetic Algorithm - based Approach to Solve Parallel Machine Scheduling with Job Delivery Coordination

This paper considers a problem in which orders are processed by either one of two parallel machines and delivered by a single delivery truck to one customer area. Coordination among production stage and distribution stage in the supply chain to achieve ideal overall system performance has become more practical and has received a lot of attention from both industry practitioners and academic res...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 12  issue 2

pages  0- 0

publication date 2019-04-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023